A Comparison between Concrete Representations for Bindings
نویسنده
چکیده
Many representations of term syntax with variable bindings have been used to formalize programming language metatheory, but so far there is no clear consensus on which is the best representation. We have undertaken an exhaustive comparison between concrete representations, among which are: names, nominal, de Bruijn indices, de Bruijn levels, locally nameless, and their variations. In the context of formalizing System F<: , we compare the possible representations of types with respect to:
منابع مشابه
Earthen architecture, an alternative to construction industry to manage the drought crisis in Iran: Comparison between water usage in a building with three type of loading system: steel, concrete, and earth
Abstract: Iran faces water shortage crisis whilst construction industry consumes huge amount of water. There are not precise data about construction industry water consumption. Accordingly, lack of comparison as well as prioritization between prevalent structural systems and alternatives which probably use less water create problems in planning for less consumption. There are two questions whi...
متن کامل-
Consider the semidirect product group H ×? K, where H and K are two arbitrary locally compact groups and K is also abelian. We introduce the continuous wavelet transform associated to some square integrable representations H ×? K. Moreover, we try to obtain a concrete form for admissible vectors of these integrable representations.
متن کاملStimulus–response bindings code both abstract and specific representations of stimuli: evidence from a classification priming design that reverses multiple levels of response representation
Repetition priming can be caused by the rapid retrieval of previously encoded stimulus-response (S-R) bindings. S-R bindings have recently been shown to simultaneously code multiple levels of response representation, from specific Motor-actions to more abstract Decisions ("yes"/"no") and Classifications (e.g., "man-made"/"natural"). Using an experimental design that reverses responses at all of...
متن کاملGeneralizing and learning protein-DNA binding sequence representations by an evolutionary algorithm
Protein-DNA bindings are essential activities. Understanding them forms the basis for further deciphering biological and genetic systems. In particular, the proteinDNA bindings between Transcription Factors (TFs) and Transcription Factor Binding Sites (TFBSs) play a central role in gene transcription. Comprehensive TF-TFBS binding sequence pairs have been found in a recent study. However, they ...
متن کاملRetrieval from long-term memory reduces working memory representations for visual features and their bindings.
The ability to remember feature bindings is an important measure of the ability to maintain objects in working memory (WM). In this study, we investigated whether both object- and feature-based representations are maintained in WM. Specifically, we tested the hypotheses that retaining a greater number of feature representations (i.e., both as individual features and bound representations) resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006